/*
 +-----------------------------------------------------------------------------------------------+
 | Project : UKAPI
 +-----------------------------------------------------------------------------------------------+
 | Project Description : Universal & Kernel API
 +-----------------------------------------------------------------------------------------------+
 | File Description :
 |   Binary Search Tree
 |                                                 
 +-----------------------------------------------------------------------------------------------+
 | Licence : MIT Licence
 +-----------------------------------------------------------------------------------------------+
 | Copyright (c) 2006 Olivier Vanhoucke
 | 
 | Permission is hereby granted, free of charge, to any person obtaining a copy of this software 
 | and associated documentation files (the "Software"), to deal in the Software without 
 | restriction, including without limitation the rights to use, copy, modify, merge, publish, 
 | distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the 
 | Software is furnished to do so, subject to the following conditions:
 | 
 | The above copyright notice and this permission notice shall be included in all copies or 
 | substantial portions of the Software.
 | 
 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
 | BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
 | NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, 
 | DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 
 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 +-----------------------------------------------------------------------------------------------+
*/

/**
 * Inclusions standards
 */
#include <ukapi.h>

/**
 * Inclusions locales
 */
#include <binarysearchtree.h>

static void bistree_internal_rotate_left( pbinarytree_node_t * node ) 
{
	pbinarytree_node_t left			= null;
	pbinarytree_node_t petit_fils	= null;

	left = binarytree_left( *node );

	if ( ( (AvlNode *) binarytree_data( left ) )->facteur == AVL_VERS_G ) 
	{
		/* Effectue une rotation GG. */

		binarytree_left( *node ) = binarytree_right( left );
		binarytree_right( left ) = *node;
		( (AvlNode *) binarytree_data( *node ) )->facteur = AVL_EQUILIBRE;
		( (AvlNode *) binarytree_data( left ) )->facteur = AVL_EQUILIBRE;
		*node = left;
	}
	else 
	{
		/* Effectue une rotation GD. */

		petit_fils						= binarytree_right( left );
		binarytree_right( left )		= binarytree_left( petit_fils );
		binarytree_left( petit_fils )	= left;
		binarytree_left( *node )		= binarytree_right( petit_fils );
		binarytree_right( petit_fils )	= *node;

		switch ( ( (AvlNode *) binarytree_data( petit_fils ) )->facteur ) 
		{
			case AVL_VERS_G:
				( (AvlNode *) binarytree_data( *node ) )->facteur = AVL_VERS_D;
				( (AvlNode *) binarytree_data( left ) )->facteur = AVL_EQUILIBRE;
				break;

			case AVL_EQUILIBRE:
				( (AvlNode *) binarytree_data( *node ) )->facteur = AVL_EQUILIBRE;
				( (AvlNode *) binarytree_data( left ) )->facteur = AVL_EQUILIBRE;
				break;

			case AVL_VERS_D:
				( (AvlNode *) binarytree_data( *node ) )->facteur = AVL_EQUILIBRE;
				( (AvlNode *) binarytree_data( left ) )->facteur = AVL_VERS_G;
				break;
		}

		( (AvlNode *) binarytree_data( petit_fils ) )->facteur = AVL_EQUILIBRE;
		*node = petit_fils;
	}

	return;
}
